Computer Analysis of World Chess Champions1
نویسندگان
چکیده
Who is the best chess player of all time? Chess players are often interested in this question that has never been answered authoritatively, because it requires a comparison between chess players of different eras who never met across the board. In this contribution, we attempt to make such a comparison. It is based on the evaluation of the games played by the World Chess Champions in their championship matches. The evaluation is performed by the chess-playing program CRAFTY. For this purpose we slightly adapted CRAFTY. Our analysis takes into account the differences in players' styles to compensate the fact that calm positional players in their typical games have less chance to commit gross tactical errors than aggressive tactical players. Therefore, we designed a method to assess the dif culty of positions. Some of the results of this computer analysis might be quite surprising. Overall, the results can be nicely interpreted by a chess expert.
منابع مشابه
Computer Analysis of World Chess Champions
Who is the best chess player of all time? Chess players are often interested in this question that has never been answered authoritatively, because it requires comparison between chess players of different eras who never met across the board. In this paper, we attempt such a comparison based on the evaluation with a chess playing program of games played by the world chess champions in their cha...
متن کاملHow Trustworthy Is Crafty’s Analysis of World Chess Champions?
In 2006, Guid and Bratko carried out a computer analysis of games played by World Chess Champions in an attempt to assess as objective as possible one aspect of the playing strength of chess players of different times. The chess program CRAFTY was used in the analysis. Given that CRAFTY’s official chess rating is lower than the rating of many of the players analysed, the question arises to what...
متن کاملOn the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess
The game of chess has always been viewed as an iconic representation of intellectual prowess. Since the very beginning of computer science, the challenge of being able to program a computer capable of playing chess and beating humans has been alive and used both as a mark to measure hardware/software progresses and as an ongoing programming challenge leading to numerous discoveries. In the earl...
متن کاملThe Ibm Deep Blue Supercomputer That Defeated World Chess Champion
Creating the first World Championclass chess computer belongs among the oldest challenges in computer science. When World Chess Champion Garry Kasparov resigned the last game of a six-game match against IBM’s Deep Blue supercomputer on 11 May 1997, his loss marked achievement of this goal. The quest for a “chess machine” dates back to 1769 when the Turk—with a human player hidden inside—debuted...
متن کاملDeep Blue: One Small Step for a Computer
Can a machine beat the human World Chess Champion in a match? This question had been around even before the existence of electronic computers, and the problem of creating such a computer had been one of the toughest problem in computer science. In 1996, Deep Blue proved that computers can beat the human World Chess Champion in a single game, and in May 1997, Deep Blue finally proved that comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006